Fast Coding of Feature Vectors Using Neighbor-to-Neighbor Search
نویسندگان
چکیده
منابع مشابه
Local Feature Binary Coding for Approximate Nearest Neighbor Search
The potential value of hashing techniques has led to it becoming one of the most active research areas in computer vision and multimedia. However, most existing hashing methods for image search and retrieval are based on global representations, e.g., GIST [3], which lack the analysis of the intrinsic geometric property of local features and heavily limit the effectiveness of the hash code. In t...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملFast Nearest Neighbor Search in Medical
We examine the problem of nding similar tumor shapes. Starting from a natural similarity function (the so-called`max morphological distance'), we show how to lower-bound it and how to search for nearest neighbors in large collections of tumor-like shapes. Speciically, we use state-of-the-art concepts from morphology, namely thèpattern spec-trum' of a shape, to map each shape to a point in n-dim...
متن کاملFast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes closer than the NN to the query must be visited. The latter, e.g., the Voronoi Network Nearest Neighbor (V N)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2016
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2015.2481390